Dormancy-aware timed branching bisimilarity for timed analysis of communication protocols

A variant of the standard notion of branching bisimilarity for processes with discrete relative timing is proposed which is coarser than the standard notion. Using a version of ACP (Algebra of Communicating Processes) with abstraction for processes with discrete relative timing, it is shown that the proposed variant allows of the functional correctness of the PAR (Positive Acknowledgement with Retransmission) protocol as well as its performance properties to be analyzed. In the version of ACP concerned, the difference between the standard notion and its proposed variant is characterized by a single axiom schema.Comment: 38 pages, revision of v2, presentation improved at several place

Conditionals in Algebraic Process Calculi

AbstractConditionals of some form are incorporated in various algebraic process calculi. What is considered to be conditions and how they are evaluated differs from one case to another. This paper gives an overview of the history of conditionals in algebraic process calculi, including the recent elaborate investigation into the potentialities of conditionals in the setting of ACP. The history of conditionals in algebraic process calculi is remarkable. It shows among other things that the potentialities of conditionals in algebraic process calculi have been underestimated for a long time. The paper ends by mentioning some open problems

On instruction sets for Boolean registers in program algebra

In previous work carried out in the setting of program algebra, including work in the area of instruction sequence size complexity, we chose instruction sets for Boolean registers that contain only instructions of a few of the possible kinds. In the current paper, we study instruction sequence size bounded functional completeness of all possible instruction sets for Boolean registers. We expect that the results of this study will turn out to be useful to adequately assess results of work that is concerned with lower bounds of instruction sequence size complexity.Comment: 18 pages, the preliminaries are largely the same as the preliminaries in arXiv:1402.4950 [cs.PL] and some earlier papers; 21 pages, presentation improve